Location:
Search - 0-1 knapsack
Search list
Description: 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
Platform: |
Size: 10011 |
Author: gtop |
Hits:
Description: 动态规划0-1背包问题-Dynamic Programming 0-1 knapsack problem
Platform: |
Size: 11097 |
Author: gtop |
Hits:
Description: 0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.
Platform: |
Size: 957 |
Author: 马涛 |
Hits:
Description: 使用贪婪算法 解决0－1背包问题MATLAB源代码-greedy algorithm used to solve 0-1 knapsack problem MATLAB source code
Platform: |
Size: 1024 |
Author: 林鑫 |
Hits:
Description: 回溯法解决0-1背包问题-Backtracking 0-1 knapsack problem solving
Platform: |
Size: 254976 |
Author: gtop |
Hits:
Description: 动态规划0-1背包问题-Dynamic Programming 0-1 knapsack problem
Platform: |
Size: 248832 |
Author: gtop |
Hits:
Description: 0-1背包问题 可以提供在背包方面遇到问题的学生或者有需要的人.-0-1 knapsack problem can provide a backpack problems encountered students or those who are in need.
Platform: |
Size: 1024 |
Author: 马涛 |
Hits:
Description: 该程序是一个用动态规划法解决0-1背包问题的小程序，可以为学习动态规划法遇到困难的同学提供帮助-the program is a dynamic programming solution 0-1 knapsack problem of small procedures, to study the dynamic programming method difficulties encountered by students for help
Platform: |
Size: 231424 |
Author: 成朝夕 |
Hits:
Description: 0-1背包问题,采用了求最优解和求最优值,分别用递归和回代来实现.-0-1 knapsack problem using the optimal solution for the optimal value and demand, and to use recursive generation to achieve.
Platform: |
Size: 7168 |
Author: 林静 |
Hits:
Description: 这是一个用C++实现的0/1背包问题，它是用贪心法实现的。-This is a C++ Achieved 0/1 knapsack problem, which is achieved using greedy method.
Platform: |
Size: 254976 |
Author: 李眼 |
Hits:
Description: 0-1背包问题的贪心算法
希望对大家有帮助-0-1 knapsack problem the greedy algorithm would like to help everyone
Platform: |
Size: 5120 |
Author: 林龙 |
Hits:
Description: 模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
Platform: |
Size: 4096 |
Author: 马贺 |
Hits:
Description: 0-1背包问题，典型的动态规划问题的实现过程-0-1 knapsack problem, a typical dynamic programming problem of the realization of the process! ! !
Platform: |
Size: 1024 |
Author: 刘艺 |
Hits:
Description: 这是一个关于0-1背包问题算法的编程实现，包括了动态规划、分支界限、回溯、贪心算法-This is a 0-1 Knapsack Problem programming, including dynamic programming, branch and bound, backtracking, greedy algorithm
Platform: |
Size: 2156544 |
Author: 哈达 |
Hits:
Description: 用禁忌搜索解决0-1背包问题，及一些关于禁忌搜索优化和并行处理的资料-Tabu search to solve 0-1 knapsack problem, and some information on tabu search optimization and parallel processing of data
Platform: |
Size: 5421056 |
Author: cmn |
Hits:
Description: 用C++工具，使用动态规划算法实现0-1背包问题,(implementation of the 0-1 knapsack problem with C++)
Platform: |
Size: 1024 |
Author: aoaopeng
|
Hits:
Description: 利用动态规划实现0-1背包问题，文件包含源代码，解释说明及测试样例(Dynamic programming to achieve 0-1 knapsack problem.)
Platform: |
Size: 447488 |
Author: pptv89 |
Hits:
Description: 文件包括回溯法求解0-1背包问题的C++源程序，包括运行界面(The file includes a backtracking method for the C++ source program for solving 0-1 knapsack problems, including the running interface)
Platform: |
Size: 43008 |
Author: yog206 |
Hits:
Description: 利用禁忌搜索算法求解0-1背包问题。禁忌搜索算法相比其他搜索算法更优，设置藐视规则来避免陷入局部最优解。(Solve 0-1 Knapsack Problem based on Tabu search. The tabu search algorithm is superior to other search algorithms and sets contempt rules to avoid falling into local optimal solutions.)
Platform: |
Size: 84992 |
Author: 大白pu |
Hits:
Description: 使用遗传算法解决0-1背包问题，调试成功，非常适合初学者了解遗传算法和0-1背包问题(Using genetic algorithm to solve 0-1 knapsack problem, debugging is successful. It is very suitable for beginners to understand genetic algorithm and 0-1 knapsack problem.)
Platform: |
Size: 21504 |
Author: MR安眠 |
Hits:
« 12
3
4
5
6
7
8
9
10
...
50
»